public class TestClass {
    public static void main(String[] args) {
        TestClass s = new TestClass();
        System.out.println("Result is " + s.longestCommonSubsequence("abcde", "ace"));
    }

    public int longestCommonSubsequence(String text1, String text2) {

        int m = text1.length() + 1;
        int n = text2.length() + 1;

        System.out.println("m " + m + " n " + n);
        System.out.println("text1 " + text1 + " text2 " + text2);

        int [][] dp = new int[m][n];

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                System.out.println("i " + i + " j " + j);
                if (text1.charAt(i-1) == text2.charAt(j-1)) {
                    dp[i][j] = 1 + dp[i-1][j-1];
                } else {
                    dp[i][j]= Math.max(dp[i-1][j], dp[i][j-1]);
                }
            }
        } 

        System.out.println("return value " + dp[m-1][n-1]);
        return dp[m-1][n-1];
    }
}